solving a multi-objective hub covering location problem with congestion by a new algorithm considering a queue theory

hub covering problem (hlp) is a very popular areas of research for its wide ranges of applications in different service or manufacturing industries. this paper considers a bi-objective hub covering location problem with congestion. the objectives minimize the total transportation cost and the total waiting time for all hobs, respectively. the resulted multi-objective decision-making problem is formulated as mixed-integer programming (mip) model. to solve this presented model, multi-objective parallel simulated annealing (mopsa) is proposed and its performance is compared with two other meta-heuristics; namely, particle sward optimization (pso) and non-dominated sorted genetic algorithm (nsga-ii). the computational results are compared in terms of four criteria including quality, mean ideal distance, diversification and spacing metrics. the associated results indicate that the presented model can outperform the other two meta-heuristics in terms of the quality metric.